Connectivity of the uniform random intersection graph
نویسندگان
چکیده
منابع مشابه
Connectivity of the uniform random intersection graph
A uniform random intersection graph G(n,m, k) is a random graph constructed as follows. Label each of n nodes by a randomly chosen set of k distinct colours taken from some finite set of possible colours of size m. Nodes are joined by an edge if and only if some colour appears in both their labels. These graphs arise in the study of the security of wireless sensor networks, in particular when m...
متن کاملOn Connectivity in a General Random Intersection Graph
Abstract There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graphG(n,−→a ,−→ Kn, Pn) defined on a set Vn comprising n vertices, where−→a is a probability vector (a1, a2, . . . , am) and −→ Kn is (K1,n,K2,n, . . . ,Km,n). This graph has been studied in the literature [10,11,20,29] including a most recent work...
متن کاملRandom Intersection Graph Process
Vertices of an affiliation network are linked to features and two vertices are declared adjacent whenever they share a common feature. We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks. We establish the asymptotic degree distribution and provide explicit asymptotic formulas for assortativity and clustering coefficients showing how these edge...
متن کاملK-connectivity of Uniform S-intersection Graphs
Let W1, . . . ,Wn be independent random subsets of [m] = {1, . . . ,m}. Assuming that each Wi is uniformly distributed in the class of d-subsets of [m] we study the uniform random intersection graph Gs(n,m, d) on the vertex set {W1, . . .Wn}, defined by the adjacency relation: Wi ∼ Wj whenever |Wi ∩Wj | ≥ s. We show that as n,m → ∞ the edge density threshold for the property that each vertex of...
متن کاملConnectivity properties of random interlacement and intersection of random walks
We consider the interlacement Poisson point process on the space of doubly-infinite Z-valued trajectories modulo time shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least one of these trajectories is the random interlacement at level u of Sznitman (2010). We prove that for any u > 0, almost surely, (1) any two vertices in the rand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.03.042